22. Depth-First Search

Depth-First Search

Depth-First Search

QUIZ QUESTION::

On which steps of its search would the DFS algorithm reach the nodes labelled A, B, and C?

ANSWER CHOICES:



Node

Expansion Order

32

14

28

20

18

25

SOLUTION:

Node

Expansion Order

32

20

18

L2 98 DFS Part 2 V3

Is the depth-first search algorithm complete? Optimal? Efficient?

SOLUTION:
  • Neither